0.00/0.12 % Problem : theBenchmark.p : TPTP v0.0.0. Released v0.0.0. 0.12/0.14 % Command : eprover-ho %s --delete-bad-limit=2000000000 --definitional-cnf=24 -s --print-statistics -R --print-version --free-numbers -auto-schedule -p --cpu-limit=%d --neg-ext=all --pos-ext=all --ext-sup-max-depth=2 --schedule-kind=CASC 0.13/0.35 % Computer : n003.cluster.edu 0.13/0.35 % Model : x86_64 x86_64 0.13/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz 0.13/0.35 % Memory : 8042.1875MB 0.13/0.35 % OS : Linux 3.10.0-693.el7.x86_64 0.13/0.35 % CPULimit : 1200 0.13/0.35 % WCLimit : 120 0.13/0.35 % DateTime : Tue Jul 13 16:14:24 EDT 2021 0.13/0.35 % CPUTime : 0.13/0.35 % Number of cores: 8 0.13/0.35 % Python version: Python 3.6.8 0.13/0.35 # Version: 2.6rc1-ho 0.13/0.36 # No SInE strategy applied 0.13/0.36 # Trying AutoSched0 for 59 seconds 1.22/1.38 # AutoSched0-Mode selected heuristic G_E___208_C18AMC_F1_SE_CS_SP_PS_S5PRR_RG_S04AN 1.22/1.38 # and selection function SelectComplexExceptUniqMaxHorn. 1.22/1.38 # 1.22/1.38 # Preprocessing time : 0.046 s 1.22/1.38 # Presaturation interreduction done 1.22/1.38 1.22/1.38 # Proof found! 1.22/1.38 # SZS status Theorem 1.22/1.38 # SZS output start CNFRefutation 1.22/1.38 thf(fact_74_Suc__lessD, axiom, ![X2:nat, X3:nat]:(ord_less_nat @ X2 @ X3<=ord_less_nat @ (suc @ X2) @ X3), file('/export/starexec/sandbox2/benchmark/theBenchmark.p', fact_74_Suc__lessD)). 1.22/1.38 thf(fact_67_not__less__eq, axiom, ![X2:nat, X3:nat]:(~(ord_less_nat @ X2 @ X3)<=>ord_less_nat @ X3 @ (suc @ X2)), file('/export/starexec/sandbox2/benchmark/theBenchmark.p', fact_67_not__less__eq)). 1.22/1.38 thf(fact_19_lessI, axiom, ![X3:nat]:ord_less_nat @ X3 @ (suc @ X3), file('/export/starexec/sandbox2/benchmark/theBenchmark.p', fact_19_lessI)). 1.22/1.38 thf(fact_39_not0__implies__Suc, axiom, ![X3:nat]:((X3)!=(zero_zero_nat)=>?[X34:nat]:(X3)=(suc @ X34)), file('/export/starexec/sandbox2/benchmark/theBenchmark.p', fact_39_not0__implies__Suc)). 1.22/1.38 thf(fact_124_Util__Div_Oless__mult__imp__div__less, axiom, ![X3:nat, X30:nat, X2:nat]:(ord_less_nat @ (divide_divide_nat @ X3 @ X2) @ X30<=ord_less_nat @ X3 @ (times_times_nat @ X30 @ X2)), file('/export/starexec/sandbox2/benchmark/theBenchmark.p', fact_124_Util__Div_Oless__mult__imp__div__less)). 1.22/1.38 thf(fact_133_mult_Ocommute, axiom, (times_times_nat)=(^[X5:nat, X68:nat]:times_times_nat @ X68 @ X5), file('/export/starexec/sandbox2/benchmark/theBenchmark.p', fact_133_mult_Ocommute)). 1.22/1.38 thf(fact_28_Suc__inject, axiom, ![X45:nat, X46:nat]:((X45)=(X46)<=(suc @ X45)=(suc @ X46)), file('/export/starexec/sandbox2/benchmark/theBenchmark.p', fact_28_Suc__inject)). 1.22/1.38 thf(fact_139_gr__zeroI, axiom, ![X3:nat]:(ord_less_nat @ zero_zero_nat @ X3<=(X3)!=(zero_zero_nat)), file('/export/starexec/sandbox2/benchmark/theBenchmark.p', fact_139_gr__zeroI)). 1.22/1.38 thf(fact_150_exists__least__lemma, axiom, ![X1:nat > $o]:(~(X1 @ zero_zero_nat)=>(?[X11:nat]:(X1 @ (suc @ X11)&~(X1 @ X11))<=?[X12:nat]:X1 @ X12)), file('/export/starexec/sandbox2/benchmark/theBenchmark.p', fact_150_exists__least__lemma)). 1.22/1.38 thf(fact_52_bot__nat__0_Oextremum__strict, axiom, ![X8:nat]:~(ord_less_nat @ X8 @ zero_zero_nat), file('/export/starexec/sandbox2/benchmark/theBenchmark.p', fact_52_bot__nat__0_Oextremum__strict)). 1.22/1.38 thf(fact_51_nat_Odistinct_I1_J, axiom, ![X24:nat]:(zero_zero_nat)!=(suc @ X24), file('/export/starexec/sandbox2/benchmark/theBenchmark.p', fact_51_nat_Odistinct_I1_J)). 1.22/1.38 thf(conj_2, conjecture, ord_less_nat @ (times_times_nat @ n @ k) @ (size_size_list_a @ xs), file('/export/starexec/sandbox2/benchmark/theBenchmark.p', conj_2)). 1.22/1.38 thf(fact_6_nat__0__less__mult__iff, axiom, ![X2:nat, X3:nat]:(ord_less_nat @ zero_zero_nat @ (times_times_nat @ X2 @ X3)<=>(ord_less_nat @ zero_zero_nat @ X2&ord_less_nat @ zero_zero_nat @ X3)), file('/export/starexec/sandbox2/benchmark/theBenchmark.p', fact_6_nat__0__less__mult__iff)). 1.22/1.38 thf(fact_29_linorder__neqE__nat, axiom, ![X60:nat, X61:nat]:((X60)!=(X61)=>(ord_less_nat @ X61 @ X60<=~(ord_less_nat @ X60 @ X61))), file('/export/starexec/sandbox2/benchmark/theBenchmark.p', fact_29_linorder__neqE__nat)). 1.22/1.38 thf(conj_0, hypothesis, (divide_divide_nat @ (size_size_list_a @ xs) @ k)=(suc @ n), file('/export/starexec/sandbox2/benchmark/theBenchmark.p', conj_0)). 1.22/1.38 thf(fact_45_zero__induct, axiom, ![X1:nat > $o, X30:nat]:(X1 @ X30=>(X1 @ zero_zero_nat<=![X11:nat]:(X1 @ X11<=X1 @ (suc @ X11)))), file('/export/starexec/sandbox2/benchmark/theBenchmark.p', fact_45_zero__induct)). 1.22/1.38 thf(fact_127_bits__div__0, axiom, ![X8:nat]:(divide_divide_nat @ zero_zero_nat @ X8)=(zero_zero_nat), file('/export/starexec/sandbox2/benchmark/theBenchmark.p', fact_127_bits__div__0)). 1.22/1.38 thf(fact_17_Suc__less__eq, axiom, ![X2:nat, X3:nat]:(ord_less_nat @ (suc @ X2) @ (suc @ X3)<=>ord_less_nat @ X2 @ X3), file('/export/starexec/sandbox2/benchmark/theBenchmark.p', fact_17_Suc__less__eq)). 1.22/1.38 thf(fact_87_nat__mult__less__cancel1, axiom, ![X30:nat, X2:nat, X3:nat]:(ord_less_nat @ zero_zero_nat @ X30=>(ord_less_nat @ (times_times_nat @ X30 @ X2) @ (times_times_nat @ X30 @ X3)<=>ord_less_nat @ X2 @ X3)), file('/export/starexec/sandbox2/benchmark/theBenchmark.p', fact_87_nat__mult__less__cancel1)). 1.22/1.38 thf(c_0_19, plain, ![X2:nat, X3:nat]:(ord_less_nat @ (suc @ X2) @ X3=>ord_less_nat @ X2 @ X3), inference(fof_simplification,[status(thm)],[fact_74_Suc__lessD])). 1.22/1.38 thf(c_0_20, plain, ![X2:nat, X3:nat]:(~ord_less_nat @ X2 @ X3<=>ord_less_nat @ X3 @ (suc @ X2)), inference(fof_simplification,[status(thm)],[fact_67_not__less__eq])). 1.22/1.38 thf(c_0_21, plain, ![X805:nat, X806:nat]:(~ord_less_nat @ (suc @ X805) @ X806|ord_less_nat @ X805 @ X806), inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_19])])). 1.22/1.38 thf(c_0_22, plain, ![X575:nat]:ord_less_nat @ X575 @ (suc @ X575), inference(variable_rename,[status(thm)],[fact_19_lessI])). 1.22/1.38 thf(c_0_23, plain, ![X718:nat, X719:nat]:((ord_less_nat @ X718 @ X719|ord_less_nat @ X719 @ (suc @ X718))&(~ord_less_nat @ X719 @ (suc @ X718)|~ord_less_nat @ X718 @ X719)), inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_20])])). 1.22/1.38 thf(c_0_24, plain, ![X2:nat, X3:nat]:(ord_less_nat @ X2 @ X3|~ord_less_nat @ (suc @ X2) @ X3), inference(split_conjunct,[status(thm)],[c_0_21])). 1.22/1.38 thf(c_0_25, plain, ![X2:nat]:ord_less_nat @ X2 @ (suc @ X2), inference(split_conjunct,[status(thm)],[c_0_22])). 1.22/1.38 thf(c_0_26, plain, ![X3:nat, X2:nat]:(~ord_less_nat @ X2 @ (suc @ X3)|~ord_less_nat @ X3 @ X2), inference(split_conjunct,[status(thm)],[c_0_23])). 1.22/1.38 thf(c_0_27, plain, ![X2:nat]:ord_less_nat @ X2 @ (suc @ (suc @ X2)), inference(spm,[status(thm)],[c_0_24, c_0_25])). 1.22/1.38 thf(c_0_28, plain, ![X740:nat]:((X740)=(zero_zero_nat)|(X740)=(suc @ (esk35_1 @ X740))), inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[fact_39_not0__implies__Suc])])])). 1.22/1.38 thf(c_0_29, plain, ![X3:nat, X30:nat, X2:nat]:(ord_less_nat @ X3 @ (times_times_nat @ X30 @ X2)=>ord_less_nat @ (divide_divide_nat @ X3 @ X2) @ X30), inference(fof_simplification,[status(thm)],[fact_124_Util__Div_Oless__mult__imp__div__less])). 1.22/1.38 thf(c_0_30, plain, ![X5:nat, X68:nat]:(times_times_nat @ X5 @ X68)=(times_times_nat @ X68 @ X5), inference(fof_simplification,[status(thm)],[fact_133_mult_Ocommute])). 1.22/1.38 thf(c_0_31, plain, ![X45:nat, X46:nat]:((suc @ X45)=(suc @ X46)=>(X45)=(X46)), inference(fof_simplification,[status(thm)],[fact_28_Suc__inject])). 1.22/1.38 thf(c_0_32, plain, ![X3:nat]:((X3)!=(zero_zero_nat)=>ord_less_nat @ zero_zero_nat @ X3), inference(fof_simplification,[status(thm)],[fact_139_gr__zeroI])). 1.22/1.38 thf(c_0_33, plain, ![X1:nat > $o]:(~X1 @ zero_zero_nat=>(?[X12:nat]:X1 @ X12=>?[X11:nat]:(X1 @ (suc @ X11)&~X1 @ X11))), inference(fof_simplification,[status(thm)],[fact_150_exists__least__lemma])). 1.22/1.38 thf(c_0_34, plain, ![X8:nat]:~ord_less_nat @ X8 @ zero_zero_nat, inference(fof_simplification,[status(thm)],[fact_52_bot__nat__0_Oextremum__strict])). 1.22/1.38 thf(c_0_35, plain, ![X2:nat]:~ord_less_nat @ (suc @ X2) @ X2, inference(spm,[status(thm)],[c_0_26, c_0_27])). 1.22/1.38 thf(c_0_36, plain, ![X2:nat]:((X2)=(zero_zero_nat)|(X2)=(suc @ (esk35_1 @ X2))), inference(split_conjunct,[status(thm)],[c_0_28])). 1.22/1.38 thf(c_0_37, plain, ![X797:nat, X798:nat, X799:nat]:(~ord_less_nat @ X797 @ (times_times_nat @ X798 @ X799)|ord_less_nat @ (divide_divide_nat @ X797 @ X799) @ X798), inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_29])])). 1.22/1.38 thf(c_0_38, plain, ![X912:nat, X913:nat]:(times_times_nat @ X912 @ X913)=(times_times_nat @ X913 @ X912), inference(variable_rename,[status(thm)],[c_0_30])). 1.22/1.38 thf(c_0_39, plain, ![X662:nat, X663:nat]:((suc @ X662)!=(suc @ X663)|(X662)=(X663)), inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_31])])). 1.22/1.38 thf(c_0_40, plain, ![X563:nat]:(zero_zero_nat)!=(suc @ X563), inference(variable_rename,[status(thm)],[fact_51_nat_Odistinct_I1_J])). 1.22/1.38 thf(c_0_41, negated_conjecture, ~ord_less_nat @ (times_times_nat @ n @ k) @ (size_size_list_a @ xs), inference(fof_simplification,[status(thm)],[inference(assume_negation,[status(cth)],[conj_2])])). 1.22/1.38 thf(c_0_42, plain, ![X683:nat, X684:nat]:(((ord_less_nat @ zero_zero_nat @ X683|~ord_less_nat @ zero_zero_nat @ (times_times_nat @ X683 @ X684))&(ord_less_nat @ zero_zero_nat @ X684|~ord_less_nat @ zero_zero_nat @ (times_times_nat @ X683 @ X684)))&(~ord_less_nat @ zero_zero_nat @ X683|~ord_less_nat @ zero_zero_nat @ X684|ord_less_nat @ zero_zero_nat @ (times_times_nat @ X683 @ X684))), inference(distribute,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[fact_6_nat__0__less__mult__iff])])])). 1.22/1.38 thf(c_0_43, plain, ![X490:nat]:((X490)=(zero_zero_nat)|ord_less_nat @ zero_zero_nat @ X490), inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_32])])). 1.22/1.38 thf(c_0_44, plain, ![X501:nat > $o, X502:nat]:((X501 @ (suc @ (esk3_1 @ X501))|~X501 @ X502|X501 @ zero_zero_nat)&(~X501 @ (esk3_1 @ X501)|~X501 @ X502|X501 @ zero_zero_nat)), inference(distribute,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_33])])])])])). 1.22/1.38 thf(c_0_45, plain, ![X611:nat]:~ord_less_nat @ X611 @ zero_zero_nat, inference(variable_rename,[status(thm)],[c_0_34])). 1.22/1.38 thf(c_0_46, plain, ![X2:nat]:((X2)=(zero_zero_nat)|~ord_less_nat @ X2 @ (esk35_1 @ X2)), inference(spm,[status(thm)],[c_0_35, c_0_36])). 1.22/1.38 thf(c_0_47, plain, ![X2:nat, X3:nat, X4:nat]:(ord_less_nat @ (divide_divide_nat @ X2 @ X4) @ X3|~ord_less_nat @ X2 @ (times_times_nat @ X3 @ X4)), inference(split_conjunct,[status(thm)],[c_0_37])). 1.22/1.38 thf(c_0_48, plain, ![X3:nat, X2:nat]:(times_times_nat @ X2 @ X3)=(times_times_nat @ X3 @ X2), inference(split_conjunct,[status(thm)],[c_0_38])). 1.22/1.38 thf(c_0_49, plain, ![X2:nat, X3:nat]:((X2)=(X3)|(suc @ X2)!=(suc @ X3)), inference(split_conjunct,[status(thm)],[c_0_39])). 1.22/1.38 thf(c_0_50, plain, ![X2:nat]:(zero_zero_nat)!=(suc @ X2), inference(split_conjunct,[status(thm)],[c_0_40])). 1.22/1.38 thf(c_0_51, plain, ![X60:nat, X61:nat]:((X60)!=(X61)=>(~ord_less_nat @ X60 @ X61=>ord_less_nat @ X61 @ X60)), inference(fof_simplification,[status(thm)],[fact_29_linorder__neqE__nat])). 1.22/1.38 thf(c_0_52, negated_conjecture, ~ord_less_nat @ (times_times_nat @ n @ k) @ (size_size_list_a @ xs), inference(split_conjunct,[status(thm)],[c_0_41])). 1.22/1.38 thf(c_0_53, plain, ![X2:nat, X3:nat]:(ord_less_nat @ zero_zero_nat @ X2|~ord_less_nat @ zero_zero_nat @ (times_times_nat @ X2 @ X3)), inference(split_conjunct,[status(thm)],[c_0_42])). 1.22/1.38 thf(c_0_54, plain, ![X2:nat]:((X2)=(zero_zero_nat)|ord_less_nat @ zero_zero_nat @ X2), inference(split_conjunct,[status(thm)],[c_0_43])). 1.22/1.38 thf(c_0_55, plain, ![X1:nat > $o, X2:nat]:(X1 @ zero_zero_nat|~X1 @ (esk3_1 @ X1)|~X1 @ X2), inference(split_conjunct,[status(thm)],[c_0_44])). 1.22/1.38 thf(c_0_56, plain, ![X2:nat]:~ord_less_nat @ X2 @ zero_zero_nat, inference(split_conjunct,[status(thm)],[c_0_45])). 1.22/1.38 thf(c_0_57, plain, ![X2:nat, X3:nat]:((divide_divide_nat @ X2 @ X3)=(zero_zero_nat)|~ord_less_nat @ X2 @ (times_times_nat @ X3 @ (esk35_1 @ (divide_divide_nat @ X2 @ X3)))), inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_46, c_0_47]), c_0_48])). 1.22/1.38 thf(c_0_58, hypothesis, (divide_divide_nat @ (size_size_list_a @ xs) @ k)=(suc @ n), inference(split_conjunct,[status(thm)],[conj_0])). 1.22/1.38 thf(c_0_59, plain, ![X2:nat]:(esk35_1 @ (suc @ X2))=(X2), inference(sr,[status(thm)],[inference(er,[status(thm)],[inference(spm,[status(thm)],[c_0_49, c_0_36])]), c_0_50])). 1.22/1.38 thf(c_0_60, plain, ![X811:nat, X812:nat]:((X811)=(X812)|(ord_less_nat @ X811 @ X812|ord_less_nat @ X812 @ X811)), inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_51])])). 1.22/1.38 thf(c_0_61, negated_conjecture, ~ord_less_nat @ (times_times_nat @ k @ n) @ (size_size_list_a @ xs), inference(rw,[status(thm)],[c_0_52, c_0_48])). 1.22/1.38 thf(c_0_62, plain, ![X3:nat, X2:nat]:((times_times_nat @ X2 @ X3)=(zero_zero_nat)|ord_less_nat @ zero_zero_nat @ X2), inference(spm,[status(thm)],[c_0_53, c_0_54])). 1.22/1.38 thf(c_0_63, plain, ![X1:nat > $o, X30:nat]:(X1 @ X30=>(![X11:nat]:(X1 @ (suc @ X11)=>X1 @ X11)=>X1 @ zero_zero_nat)), inference(fof_simplification,[status(thm)],[fact_45_zero__induct])). 1.22/1.38 thf(c_0_64, plain, ![X2:nat, X3:nat, X4:nat]:(~ord_less_nat @ X2 @ (times_times_nat @ X3 @ (esk3_1 @ (ord_less_nat @ (divide_divide_nat @ X2 @ X3))))|~ord_less_nat @ (divide_divide_nat @ X2 @ X3) @ X4), inference(rw,[status(thm)],[inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_55, c_0_47]), c_0_56]), c_0_48])). 1.22/1.38 thf(c_0_65, hypothesis, ~ord_less_nat @ (size_size_list_a @ xs) @ (times_times_nat @ k @ n), inference(sr,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_57, c_0_58]), c_0_59]), c_0_50])). 1.22/1.38 thf(c_0_66, plain, ![X3:nat, X2:nat]:((X2)=(X3)|ord_less_nat @ X2 @ X3|ord_less_nat @ X3 @ X2), inference(split_conjunct,[status(thm)],[c_0_60])). 1.22/1.38 thf(c_0_67, negated_conjecture, (ord_less_nat @ zero_zero_nat @ k|~ord_less_nat @ zero_zero_nat @ (size_size_list_a @ xs)), inference(spm,[status(thm)],[c_0_61, c_0_62])). 1.22/1.38 thf(c_0_68, plain, ![X598:nat]:(divide_divide_nat @ zero_zero_nat @ X598)=(zero_zero_nat), inference(variable_rename,[status(thm)],[fact_127_bits__div__0])). 1.22/1.38 thf(c_0_69, plain, ![X499:nat, X500:nat]:((~ord_less_nat @ (suc @ X499) @ (suc @ X500)|ord_less_nat @ X499 @ X500)&(~ord_less_nat @ X499 @ X500|ord_less_nat @ (suc @ X499) @ (suc @ X500))), inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[fact_17_Suc__less__eq])])). 1.22/1.38 thf(c_0_70, plain, ![X1:nat > $o, X2:nat]:(X1 @ (suc @ (esk3_1 @ X1))|X1 @ zero_zero_nat|~X1 @ X2), inference(split_conjunct,[status(thm)],[c_0_44])). 1.22/1.38 thf(c_0_71, plain, ![X590:nat > $o, X591:nat]:((X590 @ (suc @ (esk19_1 @ X590))|X590 @ zero_zero_nat|~X590 @ X591)&(~X590 @ (esk19_1 @ X590)|X590 @ zero_zero_nat|~X590 @ X591)), inference(distribute,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_63])])])])])])). 1.22/1.38 thf(c_0_72, hypothesis, ![X2:nat]:(~ord_less_nat @ (size_size_list_a @ xs) @ (times_times_nat @ k @ (esk3_1 @ (ord_less_nat @ (suc @ n))))|~ord_less_nat @ (suc @ n) @ X2), inference(spm,[status(thm)],[c_0_64, c_0_58])). 1.22/1.38 thf(c_0_73, hypothesis, (size_size_list_a @ xs)=(times_times_nat @ k @ n), inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_65, c_0_66]), c_0_61])). 1.22/1.38 thf(c_0_74, plain, ![X585:nat, X586:nat, X587:nat]:((~ord_less_nat @ (times_times_nat @ X585 @ X586) @ (times_times_nat @ X585 @ X587)|ord_less_nat @ X586 @ X587|~ord_less_nat @ zero_zero_nat @ X585)&(~ord_less_nat @ X586 @ X587|ord_less_nat @ (times_times_nat @ X585 @ X586) @ (times_times_nat @ X585 @ X587)|~ord_less_nat @ zero_zero_nat @ X585)), inference(distribute,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[fact_87_nat__mult__less__cancel1])])])). 1.22/1.38 thf(c_0_75, negated_conjecture, ((size_size_list_a @ xs)=(zero_zero_nat)|ord_less_nat @ zero_zero_nat @ k), inference(spm,[status(thm)],[c_0_67, c_0_54])). 1.22/1.38 thf(c_0_76, plain, ![X2:nat]:(divide_divide_nat @ zero_zero_nat @ X2)=(zero_zero_nat), inference(split_conjunct,[status(thm)],[c_0_68])). 1.22/1.38 thf(c_0_77, plain, ![X2:nat, X3:nat]:(ord_less_nat @ X2 @ X3|~ord_less_nat @ (suc @ X2) @ (suc @ X3)), inference(split_conjunct,[status(thm)],[c_0_69])). 1.22/1.38 thf(c_0_78, plain, ![X2:nat]:ord_less_nat @ X2 @ (suc @ (esk3_1 @ (ord_less_nat @ X2))), inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_70, c_0_27]), c_0_56])). 1.22/1.38 thf(c_0_79, plain, ![X1:nat > $o, X2:nat]:(X1 @ (suc @ (esk19_1 @ X1))|X1 @ zero_zero_nat|~X1 @ X2), inference(split_conjunct,[status(thm)],[c_0_71])). 1.22/1.38 thf(c_0_80, hypothesis, ![X2:nat]:(~ord_less_nat @ (times_times_nat @ k @ n) @ (times_times_nat @ k @ (esk3_1 @ (ord_less_nat @ (suc @ n))))|~ord_less_nat @ (suc @ n) @ X2), inference(rw,[status(thm)],[c_0_72, c_0_73])). 1.22/1.38 thf(c_0_81, plain, ![X2:nat, X3:nat, X4:nat]:(ord_less_nat @ (times_times_nat @ X4 @ X2) @ (times_times_nat @ X4 @ X3)|~ord_less_nat @ X2 @ X3|~ord_less_nat @ zero_zero_nat @ X4), inference(split_conjunct,[status(thm)],[c_0_74])). 1.22/1.38 thf(c_0_82, hypothesis, ord_less_nat @ zero_zero_nat @ k, inference(sr,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_58, c_0_75]), c_0_76]), c_0_50])). 1.22/1.38 thf(c_0_83, plain, ![X2:nat]:ord_less_nat @ X2 @ (esk3_1 @ (ord_less_nat @ (suc @ X2))), inference(spm,[status(thm)],[c_0_77, c_0_78])). 1.22/1.38 thf(c_0_84, plain, ![X2:nat]:ord_less_nat @ X2 @ (suc @ (esk19_1 @ (ord_less_nat @ X2))), inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_79, c_0_27]), c_0_56])). 1.22/1.38 thf(c_0_85, hypothesis, ![X2:nat]:~ord_less_nat @ (suc @ n) @ X2, inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_80, c_0_81]), c_0_82]), c_0_83])])). 1.22/1.38 thf(c_0_86, plain, ![X2:nat]:ord_less_nat @ X2 @ (esk19_1 @ (ord_less_nat @ (suc @ X2))), inference(spm,[status(thm)],[c_0_77, c_0_84])). 1.22/1.38 thf(c_0_87, hypothesis, ($false), inference(spm,[status(thm)],[c_0_85, c_0_86]), ['proof']). 1.22/1.38 # SZS output end CNFRefutation 1.22/1.38 # Proof object total steps : 88 1.22/1.38 # Proof object clause steps : 41 1.22/1.38 # Proof object formula steps : 47 1.22/1.38 # Proof object conjectures : 6 1.22/1.38 # Proof object clause conjectures : 4 1.22/1.38 # Proof object formula conjectures : 2 1.22/1.38 # Proof object initial clauses used : 20 1.22/1.38 # Proof object initial formulas used : 19 1.22/1.38 # Proof object generating inferences : 19 1.22/1.38 # Proof object simplifying inferences : 17 1.22/1.38 # Training examples: 0 positive, 0 negative 1.22/1.38 # Parsed axioms : 210 1.22/1.38 # Removed by relevancy pruning/SinE : 0 1.22/1.38 # Initial clauses : 349 1.22/1.38 # Removed in clause preprocessing : 42 1.22/1.38 # Initial clauses in saturation : 307 1.22/1.38 # Processed clauses : 16365 1.22/1.38 # ...of these trivial : 224 1.22/1.38 # ...subsumed : 13316 1.22/1.38 # ...remaining for further processing : 2825 1.22/1.38 # Other redundant clauses eliminated : 422 1.22/1.38 # Clauses deleted for lack of memory : 0 1.22/1.38 # Backward-subsumed : 134 1.22/1.38 # Backward-rewritten : 739 1.22/1.38 # Generated clauses : 103842 1.22/1.38 # ...of the previous two non-trivial : 88870 1.22/1.38 # Contextual simplify-reflections : 43 1.22/1.38 # Paramodulations : 102868 1.22/1.38 # Factorizations : 17 1.22/1.38 # NegExts : 0 1.22/1.38 # Equation resolutions : 444 1.22/1.38 # Propositional unsat checks : 0 1.22/1.38 # Propositional check models : 0 1.22/1.38 # Propositional check unsatisfiable : 0 1.22/1.38 # Propositional clauses : 0 1.22/1.38 # Propositional clauses after purity: 0 1.22/1.38 # Propositional unsat core size : 0 1.22/1.38 # Propositional preprocessing time : 0.000 1.22/1.38 # Propositional encoding time : 0.000 1.22/1.38 # Propositional solver time : 0.000 1.22/1.38 # Success case prop preproc time : 0.000 1.22/1.38 # Success case prop encoding time : 0.000 1.22/1.38 # Success case prop solver time : 0.000 1.22/1.38 # Current number of processed clauses : 1713 1.22/1.38 # Positive orientable unit clauses : 96 1.22/1.38 # Positive unorientable unit clauses: 3 1.22/1.38 # Negative unit clauses : 249 1.22/1.38 # Non-unit-clauses : 1365 1.22/1.38 # Current number of unprocessed clauses: 71448 1.22/1.38 # ...number of literals in the above : 213391 1.22/1.38 # Current number of archived formulas : 0 1.22/1.38 # Current number of archived clauses : 1060 1.22/1.38 # Clause-clause subsumption calls (NU) : 493100 1.22/1.38 # Rec. Clause-clause subsumption calls : 367176 1.22/1.38 # Non-unit clause-clause subsumptions : 7382 1.22/1.38 # Unit Clause-clause subsumption calls : 43459 1.22/1.38 # Rewrite failures with RHS unbound : 0 1.22/1.38 # BW rewrite match attempts : 205 1.22/1.38 # BW rewrite match successes : 89 1.22/1.38 # Condensation attempts : 0 1.22/1.38 # Condensation successes : 0 1.22/1.38 # Termbank termtop insertions : 1357052 1.22/1.39 1.22/1.39 # ------------------------------------------------- 1.22/1.39 # User time : 0.993 s 1.22/1.39 # System time : 0.040 s 1.22/1.39 # Total time : 1.033 s 1.22/1.39 # Maximum resident set size: 1900 pages 1.22/1.39 EOF